Generalizing DPOP: Action-GDL, a new complete algorithm for DCOPs
نویسندگان
چکیده
In this paper we made three main contributions (fully detailed in [5]). Firstly, we formulate a new algorithm, the so-called Action-GDL, that takes inspiration from GDL [1], extending and applying it to Distributed Constraint Optimization Problems (DCOPs). Secondly, we show the generality of Action-GDL showing how it generalizes DPOP[4], one of the low complexity, state-of-the-art algorithm to solve DCOPs. Finally, we provide empirical evidence of how ActionGDL can outperform DPOP in terms of the amount of computation, communication and parallelism.
منابع مشابه
Proving the equivalence of Action-GDL and DPOP
Distributed Constraint Optimization Problems (DCOPs) are a general framework that can model a large class of Multi-agent Coordination Problems (MCPs). We propose a novel message-passing algorithm, the so-called Action-GDL, as an extension to the Generalized Distributive Law algorithm to efficiently solve MCPs. We show the generality of Action-GDL by proving that it has DPOP, the low-complexity,...
متن کاملER-DCOPs: A Framework for Distributed Constraint Optimization with Uncertainty in Constraint Utilities
Distributed Constraint Optimization Problems (DCOPs) have been used to model a number of multi-agent coordination problems. In DCOPs, agents are assumed to have complete information about the utility of their possible actions. However, in many real-world applications, such utilities are stochastic due to the presence of exogenous events that are beyond the direct control of the agents. This pap...
متن کاملSolving Distributed Constraint Optimization Problems Using Logic Programming
This paper explores the use of answer set programming (ASP) in solving distributed constraint optimization problems (DCOPs). It makes the following contributions: (i) It shows how one can formulate DCOPs as logic programs; (ii) It introduces ASP-DPOP, the first DCOP algorithm that is based on logic programming; (iii) It experimentally shows that ASP-DPOP can be up to two orders of magnitude fas...
متن کاملResource-aware junction trees for efficient multi-agent coordination
In this paper we address efficient decentralised coordination of cooperative multi-agent systems by taking into account the actual computation and communication capabilities of the agents. We consider coordination problems that can be framed as Distributed Constraint Optimisation Problems, and as such, are suitable to be deployed on large scale multi-agent systems such as sensor networks or mul...
متن کاملImproving function filtering for computationally demanding DCOPs
In this paper we focus on solving DCOPs in computationally demanding scenarios. GDL optimally solves DCOPs, but requires exponentially large cost functions, being impractical in such settings. Function filtering is a technique that reduces the size of cost functions. We improve the effectiveness of function filtering to reduce the amount of resources required to optimally solve DCOPs. As a resu...
متن کامل